| 1. | A sentence of a grammar is ambiguous if there exists two syntax trees for it .
如果一文法的句子存在两个语法树，那么该句子是二义性的。 |
| 2. | A parse of a sentential form is the construction of a derivation and possibly a syntax tree for it .
句型的分析是某个推导（或许是其语法树）的构造过程。 |
| 3. | If a sentential form is ambiguous, then it has more than one syntax tree and therefore, in general, more than one handle .
如果句型是二义性的，那末，它不只有一棵语法树，因此，一般地说，也不只有一个句柄。 |
| 4. | Generating abstract syntax trees
生成抽象语法树 |
| 5. | A parse of a sentential form is the construction of a derivation and possibly a syntax tree for it
句型的分析是某个推导(或许是其语法树)的构造过程。 |
| 6. | Traverses the abstract syntax tree one or more times , collecting information and checking that the input program
遍历抽象语法树（ abstract syntax tree ， ast ）一次或多次，收集信息并检查输入程序 |
| 7. | This paper introduced a kind of variable type collecting method , which is based on layered thoughtway and abstract syntax tree
摘要提出了一种基于分层思想的，并且无需构造具体语法树的变量类型提取方法。 |
| 8. | An abstract syntax tree is built after syntax analysis and traversed three times to do semantic analysis to generate the intermediate code
在语法分析、语义分析及中间代码生成方面，先经过语法分析建立抽象语法树，然后对抽象语法树进行三次遍历完成语义分析并生成中间代码。 |
| 9. | Start generating depth - first visitors automatically with the java tree builder , a syntax tree builder used with the java compiler compiler javacc parser generator
开始自动生成深度优先访问器， java树构建器它是一种与java compiler compiler （ javacc ）解析生成器一起使用的语法树构建器。 |
| 10. | You can add new rules , either by writing java code and recompiling pmd or , a little more simply , by writing xpath expressions that are resolved against each java class s abstract syntax tree
您可以添加新规则：可以通过编写java代码并重新编译pdm ，或者更简单些，编写xpath表达式，它会针对每个java类的抽象语法树进行处理。 |
